Carrier aggregation acknowledgement bits

ABSTRACT

Systems, methods, and user equipment can involve transmitting Acknowledgement/Negative Acknowledgement (ACK/NACK) bits for carrier aggregation between a first cell and a second cell in a User Equipment (UE). With the UE, for a sub-frame, a first number of ACK/NACK bits for the first cell can be compared with a second number of ACK/NACK bits for the second cell. If a first number of ACK/NACK bits for the first cell is less than a second number of ACK/NACK bits for the second cell, an ACK/NACK bit position from the first cell can be used to transmit an ACK/NACK bit for the second cell. In some implementations, one or more DTX bits can be used to set the number of ACK/NACK bits in the first cell equal to the number of ACK/NACK bits in the second cell.

CLAIM OF PRIORITY

This application claims priority under 35 USC §119(e) to U.S. PatentApplication Ser. No. 61/679,676, filed on Aug. 3, 2012, the entirecontents of which are hereby incorporated by reference.

FIELD

The present disclosure is directed to carrier aggregation and, moreparticularly, to methods and systems involving acknowledgement bits usedwith carrier aggregation.

BACKGROUND

In wireless communications systems, such as long term evolution (LTE)systems, downlink and uplink transmissions may be organized into twoduplex modes: frequency division duplex (FDD) mode and time divisionduplex (TDD) mode. The FDD mode uses a paired spectrum where thefrequency domain is used to separate the uplink (UL) and downlink (DL)transmissions. FIG. 1A is a graphical illustration of an uplink anddownlink sub-frame separated in the frequency domain for the FDD mode.In TDD systems, an unpaired spectrum may be used where both UL and DLare transmitted over the same carrier frequency. The UL and DL areseparated in the time domain. FIG. 1B is a graphical illustration of ULand DL sub-frames sharing a carrier frequency in the TDD mode. InLTE-Advanced, carrier aggregation allows expansion of effectivebandwidth delivered to a user terminal through concurrent utilization ofradio resources across multiple carriers. Multiple component carriersare aggregated to form a larger overall transmission bandwidth. Carrieraggregation may be performed in LTE-Advanced TDD or LTE-Advanced FDDsystems.

The following terms and abbreviations may be used throughout thisdisclosure:

ACK Acknowledgement

A/N ACK/NACK

ARI ACK/NACK Resource Indicator

BPSK Binary Phase Shift Keying

CA Carrier Aggregation

CC Component Carrier

CCE Control Channel Element

CFI Control Format Indicator

CP Cyclic Prefix

CQI Channel-Quality Indicator

CRC Cyclic Redundancy Check

DAI Downlink Assignment Index

DCI Downlink Control Information

DL DownLink

DwPTS Downlink Pilot Time Slot

eNB Evolved Node B

E-UTRA Evolved Universal Terrestrial Radio Access

FDD Frequency Division Duplex

FEC Forward Error Correction

GP Guard Period

HARQ Hybrid Automatic Repeat reQuest

IDFT Inverse Discrete Fourier Transform

IE Information Element

LTE Long Term Evolution (aka E-UTRA)

MAC Medium Access Control

MIB Master Information Block

NACK Negative Acknowledgement

OCC Orthogonal Cover Code

OFDM Orthogonal Frequency Division Multiplexing

PBCH Physical Broadcast Channel

PCFICH Physical Control Format Indicator Channel

PHICH Physical Hybrid-ARQ Indicator Channel

PCell Primary Cell

PDCCH Physical Downlink Control Channel

PDSCH Physical Downlink Shared Channel

PMI Precoding-Matrix Indicator

PRACH Physical Random Access Channel

PUCCH Physical Uplink Control Channel

QPSK Quadrature Phase Shift Keying

RACH Random Access Channel

RF Radio Frequency

RS Reference Sequence

RI Rank Indicator

RNTI Radio Network Temporary Identifier

SCell Secondary Cell

SFN System Frame Number

SIB1 System Information Block Type1

SPS Semi-persistent Scheduling

SRS Sounding Reference Signal

TDD Time Division Duplex

TTI Transmission Time Interval

UCI Uplink Control Information

UE User Equipment

UL UpLink

UpPTS Uplink Pilot Time Slot

DESCRIPTION OF THE DRAWINGS

FIG. 1A is a diagram illustrating frequency division duplex, accordingto one example of principles described herein.

FIG. 1B is a diagram illustrating time division duplex, according to oneexample of principles described herein.

FIG. 2 is a diagram showing PUCCH format 1a/1b slot structure, accordingto one example of principles described herein.

FIG. 3 is a diagram showing PUCCH resource mapping, according to oneexample of principles described herein.

FIG. 4 is a diagram showing PDSCH HARQ timing linkage in carrieraggregation, according to one example of principles described herein.

FIG. 5 is a diagram showing PDSCH HARQ timing linkage in carrieraggregation, according to one example of principles described herein.

FIG. 6 is a diagram showing carrier aggregation, according to oneexample of principles described herein.

FIG. 7 is a diagram showing a UE, according to one example of principlesdescribed herein.

FIG. 8 is a flowchart showing an illustrative method for adjustingACK/NACK bits, according to one example of principles described herein.

FIG. 9 is a flowchart showing an illustrative method for adjustingACK/NACK bits, according to one example of principles described herein.

FIG. 10 is a flowchart showing an illustrative method for adjustingACK/NACK bits, according to one example of principles described herein.

FIG. 11 is a flowchart showing an illustrative method for adjustingACK/NACK bits, according to one example of principles described herein.

DETAILED DESCRIPTION

It should be understood at the outset that although illustrativeimplementations of one or more embodiments of the present disclosure areprovided below, the disclosed systems and/or methods may be implementedusing any number of techniques, whether currently known or in existence.The disclosure should in no way be limited to the illustrativeimplementations, drawings, and techniques illustrated below, includingthe exemplary designs and implementations illustrated and describedherein, but may be modified within the scope of the disclosure alongwith their full scope of equivalents.

The present disclosure includes methods and systems for carrieraggregation between two cells of a different UL/DL configuration.According to certain illustrative examples, for each sub-frame thatdiffers between the two cells, the HARQ-ACK scheme can be adjusted sothat the same number of ACK/NACK bits is sent to both cells. This may bedone so that standard mapping tables in existing specifications may beused. The following provides a more detailed explanation.

Certain aspects of the implementations include systems, methods, anduser equipment (UE) for transmitting Acknowledgement/NegativeAcknowledgement (ACK/NACK) bits for carrier aggregation between a firstcell and a second cell in a User Equipment (UE). In certain aspects, themethod may include, with the UE, for a sub-frame, comparing a firstnumber of ACK/NACK bits for the first cell with a second number ofACK/NACK bits for the second cell. If a first number of ACK/NACK bitsfor the first cell is less than a second number of ACK/NACK bits for thesecond cell, an ACK/NACK bit position from the first cell can be used totransmit an ACK/NACK bit for the second cell.

Certain aspects of the implementations include determining thatsub-frames that correspond to ACK/NACK bits for a first cell are of adifferent configuration than sub-frames that correspond to ACK/NACK bitsfor a second cell.

In certain implementations, the ACK/NACK bit positions for a cell aredescribed in a table, the table associating combinations of ACK/NACKbits to ACK/NACK signals transmitted by the UE. If the number ofACK/NACK bits for the first cell is the same as the number of ACK/NACKbits for the second cell, all ACK/NACK bit positions from the first cellcan be used to transmit only ACK/NACK bits for the first cell.

Certain aspects also include, for the sub-frame, determining that thefirst number of ACK/NACK bits for the first cell is zero. One or moreresources (e.g., ACK/NACK resources) can be used to indicate with anACK/NACK Resource Indicator (ARI) the number of resources being equal tothe second number of ACK/NACK bits for the second cell.

In certain aspects of the implementations, the ACK/NACK bit for thesecond cell transmitted in the bit position for the first cell comprisesone of: a DTX bit or an ACK bit.

Certain aspects of the implementations may also include reordering theACK/NACK bit positions of at least one of: the bit positions for thefirst cell or the bit positions of the second cell.

In certain implementations, the reordering comprises transmitting a lastACK/NACK bit for the second cell using the position of one of: a lastACK/NACK bit or a next to last ACK/NACK bit for the first cell, whereinthe last ACK/NACK bit corresponds to a sub-frame that is transmittedlast to the UE, and the next to last ACK/NACK bit corresponds to asub-frame that is transmitted immediately prior to a sub-frame that istransmitted last to the UE.

In certain aspects of the implementations, the first cell is a primarycell and the second cell is a secondary cell.

In some aspects of the implementations, the second cell is a primarycell and the first cell is a secondary cell.

Aspects of the implementations are directed to systems, methods, and UEfor transmitting Acknowledgement/Negative Acknowledgement (ACK/NACK)bits for carrier aggregation between a first cell and a second cell in aUser Equipment (UE). In the UE, for a sub-frame, it may be determinedthat a first number of ACK/NACK bits for the first cell is differentthan a second number of ACK/NACK bits for the second cell. It may alsobe determined that the sum of the first number and the second number isless than a predetermined number. The ACK/NACK bits of the first cellcan be concatenated with the ACK/NACK bits of the second cell. A set ofACK/NACK bit positions corresponding to the predetermined number can beused to transmit the concatenated bits.

Certain aspects of the implementations may include, in the UE,determining that sub-frames that correspond to ACK/NACK bits for thefirst cell are of a different configuration than sub-frames thatcorrespond to ACK/NACK bits for the second cell.

In certain aspects of the implementations, the first cell may be aprimary cell and the second cell may be a secondary cell.

In certain implementations, the second cell may be a primary cell andthe first cell may be a secondary cell.

Certain aspects of the implementations are directed to systems, methods,and UE for transmitting Acknowledgement/Negative Acknowledgement(ACK/NACK) bits for carrier aggregation between a first cell and asecond cell in a User Equipment (UE). In the UE, for a sub-frame, it maybe determined that a first number of ACK/NACK bits for the first cell isdifferent than a second number of ACK/NACK bits for the second cell. Anextra number of ACK/NACK bit positions may be added to a smaller of thefirst number and the second number of ACK/NACK bits.

Certain aspects of the implementations also may include, in the UE,determining that sub-frames that correspond to ACK/NACK bits for a firstcell are of a different configuration than sub-frames that correspond toACK/NACK bits for a second cell.

In certain implementations, the ACK/NACK bit positions for a cell aredescribed in a table, the table associating combinations of ACK/NACKbits to ACK/NACK signals transmitted by the UE.

Certain aspects of the implementations may also include, for thesub-frame, determining that the first number of ACK/NACK bits for thefirst cell is zero. One or more resources (e.g., ACK/NACK resources) mayindicate with an ACK/NACK Resource Indicator (ARI), the number ofresources being equal to the second number of ACK/NACK bits for thesecond cell.

In certain aspects of the implementations, at least one bit transmittedin the extra bit positions comprises at least one bit corresponding tothe cell with a larger of the first number and the second number ofACK/NACK bits.

In certain aspects of the implementations, the first cell may be aprimary cell and the second cell may be a secondary cell.

In certain aspects of the implementations, the second cell may be aprimary cell and the first cell may be a secondary cell.

FIGS. 1A and 1B are diagrams showing the difference between FDD and TDDsystems. The charts shown in FIGS. 1A and 1B represent frequency withthe y axis and time with the x axis. The FDD chart 100 of FIG. 1Aillustrates the downlink sub-frame 110 on channel 2 106 and the uplinksub-frame 108 on channel 1 104. Alternatively, the TDD chart 102 of FIG.1B illustrates both the downlink sub-frames 114 and the uplinksub-frames 116 on the same channel 112.

In the 3GPP LTE TDD system, a sub-frame of a radio frame can be adownlink, an uplink or a special sub-frame. The special sub-framecomprises downlink and uplink time regions separated by a guard periodfor downlink to uplink switching. The 3GPP specification standardsdefine seven different UL/DL configuration schemes for LTE TDDoperations. These schemes are listed in Table 1. D represents downlinksub-frames, U represents uplink sub-frames and S represents the specialsub-frame. The special sub-frame includes three parts, (1) the downlinkpilot time slot (DwPTS), (2) the uplink pilot time slot (UpPTS) and (3)the guard period (GP). Downlink transmissions on the PDSCH may be madein DL sub-frames or in the DwPTS portion of a special sub-frame.

The table below illustrates LTE TDD uplink-downlink configurations.

TABLE 1 Downlink- Uplink- to-Uplink downlink Switch-point Subframenumber configuration periodicity 0 1 2 3 4 5 6 7 8 9 0  5 ms D S U U U DS U U U 1  5 ms D S U U D D S U U D 2  5 ms D S U D D D S U D D 3 10 msD S U U U D D D D D 4 10 ms D S U U D D D D D D 5 10 ms D S U D D D D DD D 6  5 ms D S U U U D S U U D

As Table 1 shows, there are two switching point periodicities specifiedin the LTE standard; 5 ms and 10 ms. The 5 ms switching pointperiodicity is introduced to support the coexistence between LTE and lowchip rate UTRA TDD systems and 10 ms switching point periodicity is forthe coexistence between LTE and high chip rate UTRA TDD systems. Thesupported configurations cover a wide range of UL/DL allocations from aDL heavy 1:9 ratio to a UL heavy 3:2 ratio. The DL allocations in theseratios include both DL sub-frames and special sub-frames, which can alsocarry downlink transmissions in DwPTS. Therefore, compared to FDDsystems, TDD systems have more flexibility in terms of the proportion ofresources assignable to uplink and downlink communications within agiven assignment of spectrum. Specifically, it is possible to distributethe radio resources unevenly between uplink and downlink. This willprovide a way to utilize the radio resources more efficiently byselecting an appropriate UL/DL configuration based on interferencesituation and different traffic characteristics in DL and UL.

Because the UL and DL transmissions are not continuous (i.e. UL or DLtransmissions do not necessarily occur in every sub-frame) in an LTE TDDsystem, the scheduling and HARQ timing relationships are separatelydefined in the specifications. Currently, the HARQ ACK/NACK timingrelationship for the downlink is shown below in Table 2. It associatesan UL sub-frame n, which conveys ACK/NACK, with DL sub-frames n−ki, i=0to M−1. The set of DL sub-frames for which ACK/NACK is provided isreferred to herein as the bundling window, and the number of sub-framesfor which ACK/NACK is provided, M, is referred to as the bundling windowsize.

TABLE 2 Downlink association set index K: {k₀, k₁, . . . k_(M−1)} UL-DLSub-frame n Configuration 0 1 2 3 4 5 6 7 8 9 0 — — 6 — 4 — — 6 — 4 1 —— 7, 6 4 — — — 7, 6 4 — 2 — — 8, 7, 4, 6 — — — — 8, 7, 4, 6 — — 3 — — 7,6, 11 6, 5 5, 4 — — — — — 4 — — 12, 8, 7, 11 6, 5, 4, 7 — — — — — — 5 —— 13, 12, 9, 8, 7, 5, 4, 11, 6 — — — — — — — 6 — — 7 7 5 — — 7 7 —

The uplink HARQ ACK/NACK timing linkage is shown in table 3 below. Thetable indicates that the PHICH ACK/NACK received in the DL sub-frame iis linked with the UL data transmission in the UL sub-frame i−k, k beinggiven in Table 2. In addition, for UL/DL configuration 0, in sub-frames0 and 5, IPHICH=1 and k=6. This is because there may be two ACK/NACKsfor a UE transmitted on the PHICH in sub-frames 0 and 5, one isrepresented by IPHICH=1, the other is IPHICH=0. IPHICH just serves as anindex.

TABLE 3 k for HARQ ACK/NACK TDD UL/DL sub-frame number i Configuration 01 2 3 4 5 6 7 8 9 0 7 4 7 4 1 4 6 4 6 2 6 6 3 6 6 6 4 6 6 5 6 6 6 4 7 46

The UL grant, ACK/NACK and transmission/retransmission relationship isshown below in Table 4. The UE shall upon detection of a PDCCH with DCIformat 0 and/or a PHICH transmission in sub-frame n intended for the UE,adjust the corresponding PUSCH transmission in sub-frame n+k, with kgiven in Table 4

For TDD UL/DL configuration 0, if the least significant bit (LSB) of theUL index in the DCI format 0 is set to 1 in sub-frame n or a PHICH isreceived in sub-frame n=0 or 5 in the resource corresponding toIPHICH=1, or PHICH is received in sub-frame n=1 or 6, the UE shalladjust the corresponding PUSCH transmission in sub-frame n+7. If, forTDD UL/DL configuration 0, both the most significant bit (MSB) and LSBof the UL index in the DCI format 0 are set in sub-frame n, the UE shalladjust the corresponding PUSCH transmission in both sub-frames n+k andn+7, with k given in Table 4

TABLE 4 k for PUSCH transmission TDD UL/DL sub-frame number nConfiguration 0 1 2 3 4 5 6 7 8 9 0 4 6 4 6 1 6 4 6 4 2 4 4 3 4 4 4 4 44 5 4 6 7 7 7 7 5

As can be seen, both grant and HARQ timing linkage in TDD are much morecomplicated than the fixed time linkages used in an LTE FDD system. Itusually requires more attention in design.

The physical uplink control channel (PUCCH) format 1a/1b is used totransmit the ACK/NACK signaling when ACK/NACK is not multiplexed into aPUSCH transmission. The slot structure of PUCCH formats 1a and 1b withnormal cyclic prefix is shown in FIG. 2. Each format 1a/1b PUCCH is in asub-frame made up of two slots. The same modulation symbol is used inboth slots. Formats 1a and 1b carry one and two ACK/NACK bits,respectively. These bits are encoded into the modulation symbol usingeither BPSK or QPSK modulation using a sequence modulator 202, themodulation being based on the number of ACK/NACK bits. The symbol ismultiplied by a cyclic-shifted sequence 204 with length−12. Then, thesamples are mapped to the 12 subcarriers that the PUCCH is to occupy andthen converted to the time domain via an IDFT 206. The spread signal isthen multiplied with an orthogonal cover sequence with length of 4,w(m), where mε{0, 1, 2, 3} corresponds to each one of 4 data bearingsymbols in the slot. There are three reference symbols 208 in each slot(located in the middle symbols of the slot) that allow channelestimation for coherent demodulation of formats 1a/1b.

When downlink carrier aggregation is used or when TDD has more downlinksub-frames than uplink sub-frames, more than the two ACK/NACK bits thatcan be supported on PUCCH format 1b may be required. When 3 or 4ACK/NACK bits are needed, PUCCH format 1b may be used with channelselection.

A UE encodes information using channel selection by selecting a PUCCHresource on which to transmit. Channel selection may use 4 PUCCHresources to convey two extra bits. This can be described using a 4 bitACK/NACK configuration for TDD, shown below in Table 5:

TABLE 5 Transmission of HARQ-ACK multiplexing for M = 4 HARQ-ACK(0)n_(PUCCH) ⁽¹⁾ b(0), b(1) ACK n_(PUCCH,1) ⁽¹⁾ 1, 1 ACK n_(PUCCH,1) ⁽¹⁾ 1,0 NACK/DTX n_(PUCCH,2) ⁽¹⁾ 1, 1 ACK n_(PUCCH,1) ⁽¹⁾ 1, 0 NACKn_(PUCCH,0) ⁽¹⁾ 1, 0 ACK n_(PUCCH,1) ⁽¹⁾ 1, 0 ACK n_(PUCCH,3) ⁽¹⁾ 0, 1NACK/DTX n_(PUCCH,3) ⁽¹⁾ 1, 1 ACK n_(PUCCH,2) ⁽¹⁾ 0, 1 ACK n_(PUCCH,0)⁽¹⁾ 0, 1 ACK n_(PUCCH,0) ⁽¹⁾ 1, 1 NACK/DTX n_(PUCCH,3) ⁽¹⁾ 0, 1 NACK/DTXn_(PUCCH,1) ⁽¹⁾ 0, 0 NACK/DTX n_(PUCCH,2) ⁽¹⁾ 1, 0 NACK/DTX n_(PUCCH,3)⁽¹⁾ 1, 0 NACK/DTX n_(PUCCH,1) ⁽¹⁾ 0, 1 NACK/DTX n_(PUCCH,3) ⁽¹⁾ 0, 1NACK/DTX n_(PUCCH,2) ⁽¹⁾ 0, 0 NACK/DTX n_(PUCCH,3) ⁽¹⁾ 0, 0 DTX Notransmission

TABLE 6 QPSK modulation mapping used with channel selection b(0), b(1)QPSK symbol value 0, 0   1 0, 1 −j 1, 0   j 1, 1 −1

Each row of the table indicates a combination of ACK/NACK bits to betransmitted. The column headed by n⁽¹⁾ _(PUCCH) indicates a PUCCHresource to transmit on (using format 1b), while the column headed byb(0), b(1) indicates the value of the QPSK modulation symbol to transmiton the PUCCH resource. For LTE Rel-10, values of b(0), b(1) map to QPSKmodulation symbols as shown in Table 6 above. The UE transmits on(‘selects’) one of four PUCCH resources n⁽¹⁾ _(PUCCHi), which conveystwo bits of information in addition to the two bits carried by the QPSKmodulation. The PUCCH resource which a UE is to use may be signaled viaeither implicit or explicit signaling.

In LTE TDD operation, the number of ACK/NACK bits to be transmitted maybe reduced by spatial bundling. In spatial bundling, two HARQ-ACK bitsfor two transport blocks transmitted on one PDSCH are logical AND′dtogether, resulting in one spatially bundled HARQ-ACK bit. In Rel-10TDD, spatial bundling is applied in subframes where the bundling windowsize is larger than 1, and so in this case the number of HARQ-ACK bitsis equal to the bundling window size. Also, because only one HARQ-ACKbit is needed when MIMO is not configured for a UE, the number ofHARQ-ACK bits is equal to the bundling window size when MIMO is notconfigured.

In the case of implicit signaling for TDD, for a PDSCH transmissionindicated by the detection of corresponding PDCCH or a PDCCH indicatingdownlink SPS release in sub-frame n−k_(i) where k_(i) is an element ofK, k_(i)εK, defined in Table 1, the PUCCH resource n_(PUCCH,i)⁽¹⁾=(M−i−1)·N_(c)+i·N_(c+1)+n_(CCE,i)+N_(PUCCH) ⁽¹⁾, where c is selectedfrom {0, 1, 2, 3} such that N_(c)≦n_(CCE,i)<N_(c+1), where M is thenumber of elements in the set K defined in Table. N_(c)=max{0, └[N_(RB)^(DL)·(N_(sc) ^(RB)·c−4)]/36┘}, n_(CCE,i) is the number of the first CCEused for transmission of the corresponding PDCCH in sub-frame n−k_(i),and N_(PUCCH) ⁽¹⁾ is configured by higher layers. In the case ofexplicit signaling, the PUCCH resource is indicated via the ACK/NACKresource indicator (ARI) bits and higher layer configuration. FIG. 3illustrates the PUCCH resource mapping scheme.

In carrier aggregation (CA), PUCCH resources 304 are signaled implicitlyusing the location of the scheduling grant for the UE on the PDCCH ofits primary cell (PCell), and PUCCH resources 304 may be indicated usingthe ARI bits contained in the grant for the UE on the PDCCH 302 of oneof the UE's secondary cells (SCells). This means that, if the secondarycell (“SCell”) is cross carrier scheduled by PDCCH 302 transmitted onthe primary cell (“PCell”), then the PUCCH resource 304 is implicitlysignaled by the first CCE index. If the SCell schedules a PDSCH usingits own PDCCH 302, the PUCCH resource index is determined by the ARIbits.

As in LTE FDD, the current Rel-10 LTE specification defines carrieraggregation (CA) for TDD systems. However, it only supports CA for cellshaving the same UL/DL configuration on the aggregated carriers. Methodsdescribed herein enable support for CA with cells that have differentTDD UL/DL configurations.

PDSCH HARQ timing of SCell may follow the reference configuration timingsummarized in Table 7 at least for full duplex self-scheduling case.

TABLE 7 Reference configuration for SCe11 PDSCH HARQ timing. Pcell SIB1Scell SIB1 Configuration Configuration 0 1 2 3 4 5 6 0 0 1 2 3 4 5 6 1 11 2 4 4 5 1 2 2 2 2 5 5 5 2 3 3 4 5 3 4 5 3 4 4 4 5 4 4 5 4 5 5 5 5 5 55 5 6 6 1 2 3 4 5 6

It is noted that a component carrier (‘CC’) is also known as a servingcell or a cell. Furthermore, when multiple CCs are scheduled, for eachUE, one of the CCs is designated as the primary carrier which is usedfor PUCCH transmission, semi-persistent scheduling, etc, while theremaining CCs are configured as secondary CCs. This primary carrier isalso known as PCell (Primary cell), while the secondary CC is known asSCell (Secondary cell).

Because UEs receiving a PDSCH on a PCell use the PCell as the HARQtiming reference for the PDSCH, there are cases where the timingreference for the PDSCH on the SCell based on Table 7 may be differentfrom that of the PCell. As a result, the downlink association sets ofPCell and SCell may be different for a given UL sub-frame in Table 2.The current specification (Rel-10) only specifies the method oftransmitting PDSCH ACK/NACK bits using PUCCH format 1a/1b with channelselection in the scenario with the same downlink association set(therefore having the same bundling window size). This method needs tobe changed to deal with the different bundling window sizes ininter-band CA with different UL/DL configurations.

In methods described herein, PUCCH may be transmitted only on PCell inthe case of inter-band CA with different UL/DL configurations.Therefore, PDSCH HARQ ACK/NACK bits for both PCell and SCell have to beconveyed on PCell if PUCCH is used. For the same bundling window size onPCell and SCell, the scheme to use PUCCH format 1b with channelselection for ACK/NACK transmission has been defined in Release 10specification 3GPP TS 36.213. References to tables 10.1.3.2-1,10.1.3.2-2, 10.1.3.2-3, 10.1.3.2-5, or 10.1.3.2-6 are references totables found in 3gPP TS 36.213.

In inter-band CA with different UL/DL configurations, the bundlingwindow size of different cells may be different. For example, as shownin FIG. 4, the PCell with UL/DL configuration 1 is aggregated with theSCell of UL/DL configuration 2. Based on the PDSCH HARQ timingagreement, the PCell follows its own UL/DL configuration 1 PDSCH HARQtiming. The SCell follows UL/DL configuration 2 timing reference, asindicated in Table 7. The solid line 402 represents the PDSCH HARQtiming linkage of the PCell. The dotted line 404 represents the PDSCHHARQ timing of SCell. Herein we refer to the bundling window size forPCell using Mp, and the bundling window for SCell using Ms. On PCellsub-frame #2 or #7, the bundling window size for the PCell is two(Mp=2), and for the SCell it is four (Ms=4). At sub-frame #3 or #8,Mp=1, Ms=0. In this case the bundling window size matches the number ofelements in the downlink association set in Table 2. However, thebundling window sizes are different for the PCell and the SCell.

Another example where the PCell is configuration 2 and the SCell isconfiguration 1 is shown in FIG. 5. From Table 7, the PDSCH HARQ timingfollows configuration 2 for both the PCell and the SCell. So, thedownlink association set is the same for both cells if it is solelydependent on Table 2. However, as we can see from FIG. 5, becausesub-frame #8 and #3 on the SCell are UL sub-frames, there will never bePDSCH on these two sub-frames. Again, the solid line 502 represents thePDSCH HARQ timing linkage of the PCell and the dotted line 504represents the PDSCH HARQ timing of SCell. The bundling window size forthe PCell is four (Mp=4), and for the SCell is three (Ms=3). They aredifferent as well even though the downlink association set is same basedon the reference UL/DL configuration. Therefore, new schemes have to beproposed to deal with the different bundling window sizes in inter-bandCA with different UL/DL configurations.

Through methods described herein, the existing ACK/NACK codebook for aone serving cell mapping table and a two cell mapping table (seeappendices for example tables) can be directly used without anymodification. At a sub-frame where all ACK/NACKs are for one cell, a oneserving cell mapping table is used to avoid using unnecessary DTX bits.If the number of ACK/NACK bits for the first cell and second cell aredifferent, but non-zero, then the ACK/NACK bits can be reordered oradjusted to minimize the number of ACK/NACK bits required. This can bedone without the need for modified codebooks.

Table lists possible combinations of bundling window size for PCell andSCell, (Mp, Ms). Note that this is only intended for PUCCH format 1bwith channel selection. Any CA case involving UL/DL configuration 5 orreferring it as reference timing may use PUCCH format 3 due to the largenumber of ACK/NACK bits. The CA with the same UL/DL configuration onboth PCell and SCell is not listed in the table either because it hasalready been covered in the current specification.

TABLE 8 Possible combination of (Mp, Ms) with different CA scenariosPCell SIB1 PCell SCell SIB1 Config Config PUCCH SF # 0 1 2 3 4 5 6 0 2(1, 2) (1, 4) (1, 3) (1, 4) (1, 1) 3 (0, 1) (0, 0) (0, 2) (0, 4) (0, 1)4 (1, 0) (1, 0) (1, 2) (1, 0) (1, 1) 7 (1, 2) (1, 4) (1, 0) (1, 0)(1, 1) 8 (0, 1) (0, 1) 9 (1, 0) (1, 0) (1, 0) (1, 0) (1, 0) 1 2 (2, 2)(2, 4) (2, 3) (2, 4) (2, 2) 3 (1, 0) (1, 0) (1, 4) (1, 4) (1, 1) 4 7 (2,2) (2, 4) (2, 0) (2, 0) (2, 2) 8 (1, 0) (1, 0) (1, 0) (1, 0) (1, 0) 9 22 (4, 2) (4, 3) (4, 2) 3 4 7 (4, 2) (4, 3) (4, 3) 8 9 3 2 (3, 3) (3, 4)(3, 4) (3, 3) 3 (2, 0) (2, 2) (2, 4) (2, 0) 4 (2, 1) (2, 0) (2, 0) (2,2) 7 8 9 4 2 (4, 3) (4, 4) (4, 3) (4, 3) 3 (4, 1) (4, 2) (4, 4) (4, 2) 47 8 9 5 2 3 4 7 8 9 6 2 (1, 1) (1, 2) (1, 4) (1, 3) (1, 4) 3 (1, 1)(1, 1) (1, 0) (1, 2) (1, 4) 4 (1, 0) (1, 0) (1, 0) (1, 2) (1, 0) 7(1, 1) (1, 2) (1, 4) (1, 0) (1, 0) 8 (1, 1) (1, 1) (1, 0) (1, 0) (1, 0)9

With the methods described herein, the existing ACK/NACK codebook forone serving cell Table 10.1.3-5/6/7 and two cells Table10.1.3.2-1/2/3/5/6 defined in 3GPP TS 36.213 can be directly usedwithout any modification.

An example of a mapping table is shown below:

TABLE 9 Transmission of Format 1b HARQ-ACK channel selection for A = 4HARQ-ACK(0) HARQ-ACK(1) HARQ-ACK(2) HARQ-ACK(3) n_(PUCCH) ⁽¹⁾ b(0)b(1)ACK ACK ACK ACK n_(PUCCH,1) ⁽¹⁾ 1, 1 ACK NACK/DTX ACK ACK n_(PUCCH,2)⁽¹⁾ 0, 1 NACK/DTX ACK ACK ACK n_(PUCCH,1) ⁽¹⁾ 0, 1 NACK/DTX NACK/DTX ACKACK n_(PUCCH,3) ⁽¹⁾ 1, 1 ACK ACK ACK NACK/DTX n_(PUCCH,1) ⁽¹⁾ 1, 0 ACKNACK/DTX ACK NACK/DTX n_(PUCCH,2) ⁽¹⁾ 0, 0 NACK/DTX ACK ACK NACK/DTXn_(PUCCH,1) ⁽¹⁾ 0, 0 NACK/DTX NACK/DTX ACK NACK/DTX n_(PUCCH,3) ⁽¹⁾ 1, 0ACK ACK NACK/DTX ACK n_(PUCCH,2) ⁽¹⁾ 1, 1 ACK NACK/DTX NACK/DTX ACKn_(PUCCH,2) ⁽¹⁾ 1, 0 NACK/DTX ACK NACK/DTX ACK n_(PUCCH,3) ⁽¹⁾ 0, 1NACK/DTX NACK/DTX NACK/DTX ACK n_(PUCCH,3) ⁽¹⁾ 0, 0 ACK ACK NACK/DTXNACK/DTX n_(PUCCH,0) ⁽¹⁾ 1, 1 ACK NACK/DTX NACK/DTX NACK/DTX n_(PUCCH,0)⁽¹⁾ 1, 0 NACK/DTX ACK NACK/DTX NACK/DTX n_(PUCCH,0) ⁽¹⁾ 0, 1 NACK/DTXNACK NACK/DTX NACK/DTX n_(PUCCH,0) ⁽¹⁾ 0, 0 NACK NACK/DTX NACK/DTXNACK/DTX n_(PUCCH,0) ⁽¹⁾ 0, 0 DTX DTX NACK/DTX NACK/DTX No Transmission

An example of a two cell mapping is shown below:

TABLE 10 Transmission of HARQ-ACK multiplexing for M = 3 Primary CellSecondary Cell HARQ-ACK(0), HARQ- HARQ-ACK(0), HARQ- ResourceConstellation RM Code Input Bits ACK(1), HARQ-ACK(2) ACK(1), HARQ-ACK(2)n_(PUCCH) ⁽¹⁾ b(0), b(1) o(0), o(1), o(2), o(3) ACK, ACK, ACK ACK, ACK,ACK n_(PUCCH,1) ⁽¹⁾ 1, 1 1, 1, 1, 1 ACK, ACK, NACK/DTX ACK, ACK, ACKn_(PUCCH,1) ⁽¹⁾ 0, 0 1, 0, 1, 1 ACK, NACK/DTX, any ACK, ACK, ACKn_(PUCCH,3) ⁽¹⁾ 1, 1 0, 1, 1, 1 NACK/DTX, any, any ACK, ACK, ACKn_(PUCCH,3) ⁽¹⁾ 0, 1 0, 0, 1, 1 ACK, ACK, ACK ACK, ACK, NACK/DTXn_(PUCCH,0) ⁽¹⁾ 1, 0 1, 1, 1, 0 ACK, ACK, NACK/DTX ACK, ACK, NACK/DTXn_(PUCCH,3) ⁽¹⁾ 1, 0 1, 0, 1, 0 ACK, NACK/DTX, any ACK, ACK, NACK/DTXn_(PUCCH,0) ⁽¹⁾ 0, 1 0, 1, 1, 0 NACK/DTX, any, any ACK, ACK, NACK/DTXn_(PUCCH,3) ⁽¹⁾ 0, 0 0, 0, 1, 0 ACK, ACK, ACK ACK, NACK/DTX, anyn_(PUCCH,2) ⁽¹⁾ 1, 1 1, 1, 0, 1 ACK, ACK, NACK/DTX ACK, NACK/DTX, anyn_(PUCCH,2) ⁽¹⁾ 0, 1 1, 0, 0, 1 ACK, NACK/DTX, any ACK, NACK/DTX, anyn_(PUCCH,2) ⁽¹⁾ 1, 0 0, 1, 0, 1 NACK/DTX, any, any ACK, NACK/DTX, anyn_(PUCCH,2) ⁽¹⁾ 0, 0 0, 0, 0, 1 ACK, ACK, ACK NACK/DTX, any, anyn_(PUCCH,1) ⁽¹⁾ 1, 0 1, 1, 0, 0 ACK, ACK, NACK/DTX NACK/DTX, any, anyn_(PUCCH,1) ⁽¹⁾ 0, 1 1, 0, 0, 0 ACK, NACK/DTX, any NACK/DTX, any, anyn_(PUCCH,0) ⁽¹⁾ 1, 1 0, 1, 0, 0 NACK, any, any NACK/DTX, any, anyn_(PUCCH,0) ⁽¹⁾ 0, 0 0, 0, 0, 0 DTX, any, any NACK/DTX, any, any NoTransmission 0, 0, 0, 0

FIG. 6 is a diagram showing an illustrative communication system 600 inwhich carrier aggregation may be used. According to certain illustrativeexamples, the system 600 includes a primary cell 602, a secondary cell604, and a UE 612. Both cells 602, 604 include a processor 606, acomputer readable medium 608, and a communication interface 610. Theprocessor 606 is used to process a set of computer readable instructionswhich may be stored on the computer readable medium 608. The computerreadable instructions, when executed by the processor 606, cause thecell to perform a variety of tasks related to routing, switching, andother tasks for management of wireless voice and data traffic betweenthe cells and a number of UEs 612.

FIG. 7 is a schematic block diagram of the UE 612. The UE 612 includes adigital signal processor (DSP) 702 and a memory 704. As shown, the UE612 may further include an antenna and front end unit 706, a radiofrequency (RF) transceiver 708, an analog baseband processing unit 710,a microphone 712, an earpiece speaker 714, a headset port 716, aninput/output interface 718, a removable memory card 720, a universalserial bus (USB) port 722, a short range wireless communicationsub-system 724, an alert 726, a keypad 728, a liquid crystal display(LCD), which may include a touch sensitive surface 730, an LCDcontroller 732, a charge-coupled device (CCD) camera 734, a cameracontroller 736, and a global positioning system (GPS) sensor 738.

The DSP 702 or some other form of controller or central processing unitoperates to control the various components of the UE 612 in accordancewith embedded software or firmware stored in memory 704. In addition tothe embedded software or firmware, the DSP 702 may execute otherapplications stored in the memory 704 or made available via informationcarrier media such as portable data storage media like the removablememory card 720 or via wired or wireless network communications. Theapplication software may comprise a compiled set of machine-readableinstructions that configure the DSP 702 to provide the desiredfunctionality, or the application software may be high-level softwareinstructions to be processed by an interpreter or compiler to indirectlyconfigure the DSP 702.

The antenna and front end unit 706 may be provided to convert betweenwireless signals and electrical signals, enabling the UE 612 to send andreceive information from a cellular network or some other availablewireless communications network. The RF transceiver 708 providesfrequency shifting, converting received RF signals to baseband andconverting baseband transmit signals to RF. The analog basebandprocessing unit 710 may provide channel equalization and signaldemodulation to extract information from received signals, may modulateinformation to create transmit signals, and may provide analog filteringfor audio signals. To that end, the analog baseband processing unit 710may have ports for connecting to the built-in microphone 712 and theearpiece speaker 714 that enable the UE 612 to be used as a cell phone.The analog baseband processing unit 710 may further include a port forconnecting to a headset or other hands-free microphone and speakerconfiguration.

The DSP 702 may send and receive digital communications with a wirelessnetwork via the analog baseband processing unit 710. In someembodiments, these digital communications may provide Internetconnectivity, enabling a user to gain access to content on the Internetand to send and receive e-mail or text messages. The input/outputinterface 718 interconnects the DSP 702 and various memories andinterfaces. The memory 704 and the removable memory card 720 may providesoftware and data to configure the operation of the DSP 702. Among theinterfaces may be the USB interface 722 and the short range wirelesscommunication sub-system 724. The USB interface 722 may be used tocharge the UE 612 and may also enable the UE 612 to function as aperipheral device to exchange information with a personal computer orother computer system. The short range wireless communication sub-system724 may include an infrared port, a Bluetooth interface, an IEEE 802.11compliant wireless interface, or any other short range wirelesscommunication sub-system, which may enable the UE 612 to communicatewirelessly with other nearby mobile devices and/or wireless basestations.

The input/output interface 718 may further connect the DSP 702 to thealert 726 that, when triggered, causes the UE 612 to provide a notice tothe user, for example, by ringing, playing a melody, or vibrating. Thealert 726 may serve as a mechanism for alerting the user to any ofvarious events such as an incoming call, a new text message, and anappointment reminder by silently vibrating, or by playing a specificpre-assigned melody for a particular caller.

The keypad 728 couples to the DSP 702 via the interface 718 to provideone mechanism for the user to make selections, enter information, andotherwise provide input to the UE 612. The keyboard 728 may be a full orreduced alphanumeric keyboard such as QWERTY, Dvorak, AZERTY andsequential types, or a traditional numeric keypad with alphabet lettersassociated with a telephone keypad. The input keys may include atrackwheel, an exit or escape key, a trackball, and other navigationalor functional keys, which may be inwardly depressed to provide furtherinput function. Another input mechanism may be the LCD 730, which mayinclude touch screen capability and also display text and/or graphics tothe user. The LCD controller 732 couples the DSP 702 to the LCD 730.

The CCD camera 734, if equipped, enables the UE 612 to take digitalpictures. The DSP 702 communicates with the CCD camera 734 via thecamera controller 736. The GPS sensor 738 is coupled to the DSP 702 todecode global positioning system signals, thereby enabling the UE 612 todetermine its position. Various other peripherals may also be includedto provide additional functions, e.g., radio and television reception.

FIG. 8 is a flowchart showing an illustrative method 800 for adjustingthe number and/or order of ACK/NACK bits. In this illustrative method,Mp is equal to the number of ACK/NACK bits for the primary cell, and Msis equal to the number of ACK/NACK bits for the SCell. According tocertain illustrative examples, for a particular sub-frame, it isdetermined 802 whether the bundling window size for a primary cell (Mp)is equal to the bundling window size for a secondary cell (Ms). If it isdetermined (802, YES) that Mp=Ms, then the method proceeds 804 accordingto normal operations. This involves using a standard mapping table forthe appropriate bundling window size.

If it is determined (802, NO) that Mp does not equal Ms, then the methodproceeds. It is next determined 806 whether or not both Mp and Ms arenon-zero. If it is determined that either Mp or Ms is zero (806, NO),then a one serving cell mapping table is used 812. The number ofACK/NACK bit positions for the mapping table will be equal to thenon-zero number of either Mp or Ms. In some examples, a resourceallocation method may then be used 814. This resource allocation methodwill be discussed in more detail below.

If it is determined (806, YES) that both Mp and Ms are non-zero, then atwo serving cell mapping table is used. The M value to be used in thetable will be 808 the greater of Mp or Ms. The remaining bits from thesmaller of Mp or Ms may then be filled in 810 with extra bits. Theseextra bits may be, e.g., DTX bits or ACK bits.

An example of this method may also be described as follows:

-   -   If Mp=Ms, the UE shall use the Rel-10 two serving cell mapping        table (one of tables 10.1.3.2-1, 10.1.3.2-2, 10.1.3.2-3,        10.1.3.2-5, or 10.1.3.2-6), resource allocation, and spatial        bundling procedures directly.    -   Else if both Mp and Ms are nonzero,        -   The UE shall use the Rel-10 two serving cell mapping (one of            tables 10.1.3.2-1, 10.1.3.2-2, 10.1.3.2-3, 10.1.3.2-5, or            10.1.3.2-6) with M=max{Mp, Ms} or A=max{Mp, Ms}, where Mp is            the number of elements in set Kc for the primary cell and Ms            is the number of elements in set Kc for the secondary cell.        -   The UE shall set DTX for {HARQ-ACK(min{Mp, Ms}), . . . ,            HARQ-ACK(M−1)} for the serving cell with the smaller Mc            value.    -   Else,        -   The UE shall use the Rel-10 mapping table for one serving            cell with M=max {Mp, Ms} along with the resource allocation            described below.

Alternatively, UE may set ACK instead of DTX for {HARQ-ACK(min{Mp, Ms}),HARQ-ACK(M−1)} bits if there is a performance advantage to do so. Otheralternatives, such as using (M, min{Mp, Ms}) block code, are alsopossible.

It is noted that using the Rel-10 mapping for one serving cell (that is,one of tables 10.1.3.2-1, 10.1.3.2-2, 10.1.3.2-3, 10.1.3.2-5, or10.1.3.2-6)) requires the use of a one serving cell resource allocationmethod. The Rel-10 implicit one serving cell resource allocation is usedin our method if the PCell is not DTX. However, when the PCell is DTX,up to 4 PUCCH resources will be needed from the SCell. In Rel-10, ARI isused to allocate up to 4 PUCCH resources when a PDCCH is detected onSCell. Therefore, in our method, when a one serving cell mapping tableis used and a PDCCH is detected on SCell, ARI (using the two powercontrol bits in the SCell's PDCCHs) will indicate 2, 3, or, 4 PUCCHresources for sub-frames with Ms=2, 3, or 4, respectively. This has anadvantage when one of the Mp and Ms equals to zero. For example, whenPCell is UL/DL configuration 0 and SCell configuration 4, at sub-frame#3, Mp=0, Ms=4.

FIG. 9 is a flowchart showing an illustrative method 900 for adjustingthe number and/or order of ACK/NACK bits. In this illustrative method,Mp is equal to the number of ACK/NACK bits for the primary cell, and Msis equal to the number of ACK/NACK bits for the SCell. According tocertain illustrative examples, assuming that HARQ-ACK₁(i) is an ACK/NACKbit for the serving cell with the larger bundling window size, andHARQ-ACK₂(i) is an ACK/NACK bit for the smaller bundling window size,and that both Mp and Ms are not equal and both non-zero, the methodstarts by setting 902 M equal to (Mp+Ms)/2 while rounding up ifnecessary. It is then determined 904 whether the larger of Mp or Ms(Mmax) minus the smaller of Mp or Ms (Mmin) is greater than one. If itis determined (904, NO) that Mmax−Mmin is equal to one, then an extrabit position is appended 906 to ACK/NACK bit set with length of Mmin.If, however, it is determined (904, YES) that Mmax−Mmin is greater thanone, the method proceeds. The ACK/NACK bits are then set 908 for bothcells as follows:

-   -   {HARQ-ACK₁(0), . . . , HARQ-ACK₁(M−1)}    -   {HARQ-ACK₂(0), . . . , HARQ-ACK₂(M−1), HARQ-ACK₁(M), . . . ,        HARQ-ACK₁(M_(max)−1)}

It is then determined 910 whether the number of elements in{HARQ-ACK₂(0), . . . , HARQ-ACK₂(Mmin−1), HARQ-ACK₁(M), . . . ,HARQ-ACK₁(Mmax−1)} (illustrated as “X” in the flowchart) is less than M.If so (910, YES), then a bit is appended 914 to it as follows:

-   -   The UE shall append a DTX at the end of {HARQ-ACK₂(0), . . . ,        HARQ-ACK₂(M_(min)−1), HARQ-ACK₁(M), . . . ,        HARQ-ACK((M_(max)−1)}    -   Two sets {HARQ-ACK₁(0), . . . , HARQ-ACK₁(M−1)} and        {HARQ-ACK₂(0), . . . , HARQ-ACK₂(M_(min)−1), HARQ-ACK₁(M), . . .        , HARQ-ACK (M_(max)−1), DTX} have the same length and use the        Rel-10 mapping table with a bundling window size of M.

Otherwise (910, NO), the method proceeds as follows to use 912 the twoserving cell mapping table:

-   -   Else, two sets {HARQ-ACK₁(0), . . . , HARQ-ACK₁(M−1)} and        {HARQ-ACK₂(0), . . . , HARQ-ACK₂(M_(min)−1), HARQ-ACK₁(M), . . .        , HARQ-ACK₁(M_(max)−1)} have the same length, and the UE shall        use Rel-10 two serving cells mapping table with M.

With methods described herein, reordering the ACK/NACK bits instead offilling up with DTX bits before using the existing ACK/NACK codebooksmay be done. Assume that HARQ-ACK₁(i) is the ACK/NACK bit for theserving cell with the larger bundling window size, and HARQ-ACK₂(i) forthe smaller bundling window size. M_(max)=max{Mp, Ms}, M_(min)=min{Mp,Ms}. This approach may also be described as follows, additionallycomprising PUCCH resource allocation:

-   -   If Mp=Ms, the UE shall use one of tables 10.1.3.2-1, 10.1.3.2-2,        10.1.3.2-3, 10.1.3.2-5, or 10.1.3.2-6, resource allocation, and        spatial bundling procedure directly.    -   Else if one of Mp and Ms is zero, the UE shall use one of tables        10.1.3.2-1, 10.1.3.2-2, 10.1.3.2-3, 10.1.3.2-5, or 10.1.3.2-6        and spatial bundling procedure for one cell with M max {Mp, Ms}        along with the revised one serving cell resource allocation        described above.    -   Else        -   Rel-10 spatial bundling is used, where if Mp>1 or Ms>1,            spatial HARQ-ACK bundling across multiple codewords within a            DL sub-frame is performed by a logical AND operation of all            the corresponding individual HARQ-ACKs within the cell whose            M>1. HARQ-ACKs in PCell are not spatially bundled with            HARQ-ACKs in SCell.        -   The UE shall use one of tables 10.1.3.2-1, 10.1.3.2-2,            10.1.3.2-3, 10.1.3.2-5, or 10.1.3.2-6 with            M=ceil{(Mp+Ms)/2}, where Mp is the number of elements in set            Kc for the primary cell and Ms is the number of elements in            set Kc for the secondary cell.        -   if (M_(max)−M_(min))>1, reordering the ACK/NACK bits into            -   {HARQ-ACK₁(0), . . . , HARQ-ACK₁(M−1)}            -   {HARQ-ACK₂(0), . . . , HARQ-ACK₂(M_(min)−1),                HARQ-ACK₁(M), . . . , HARQ-ACK₁(M_(max)−1)}            -   if the number of elements in {HARQ-ACK₂(0), . . . ,                HARQ-ACK₂(M_(min)−1), HARQ-ACK₁(M), . . . ,                HARQ-ACK₁(M_(max)−1)} is less than M,                -   The UE shall append a DTX at the end of                    {HARQ-ACK₂(0), . . . , HARQ-ACK₂(M_(min)−1),                    HARQ-ACK₁(M), . . . , HARQ-ACK₁(M_(max)1)}                -   Two sets {HARQ-ACK₁(0), . . . , HARQ-ACK₁(M−1)} and                    {HARQ-ACK₂(0), . . . , HARQ-ACK₂(M_(min)−1),                    HARQ-ACK₁(M), . . . , HARQ-ACK₁(M_(max)−1), DTX}                    have the same length and use the Rel-10 mapping                    table with a bundling window size of M.            -   Else, two sets {HARQ-ACK₁(0), . . . , HARQ-ACK₁(M−1)}                and {HARQ-ACK₂(0), . . . , HARQ-ACK₂(M_(min)−1),                HARQ-ACK₁(M), . . . , HARQ-ACK₁(M_(max)−1)} have the                same length, and the UE shall use Rel-10 two serving                cells mapping table with M.        -   Else, if (M_(max)−M_(min))=1,            -   The UE shall append a DTX at the end of {HARQ-ACK₂(0), .                . . , HARQ-ACK₂(M_(min)−1)}            -   Two sets {HARQ-ACK₁(0), . . . , HARQ-ACK₁(M−1)} and                {HARQ-ACK₂(0), . . . , HARQ-ACK₂(M_(min)−1), DTX} have                the same length and use the Rel-10 two serving cells                mapping table with M.        -   If Ms=1 in any sub-frame, ARI on SCell will indicate 2 PUCCH            resources n_(PUCCH,2) ⁽¹⁾, and n_(PUCCH,3) ⁽¹⁾) using the            mechanism defined in Rel-10, even if one spatial layer is            transmitted on SCell. This step ensures that the required 4            PUCCH resources are available when one spatial layer is            transmitted on SCell.        -   If Mp=1 in any sub-frame, implicit PUCCH resources            (n_(PUCCH,0) ⁽¹⁾, and n_(PUCCH,1) ⁽¹⁾) are derived from            n_(cce) and n_(cce+1) using the mechanism defined in Rel-10,            even if one spatial layer is transmitted on PCell. This step            ensures that the required 4 PUCCH resources are available            when one spatial layer is transmitted on PCell.

FIG. 10 is a flowchart showing an illustrative method 1000 for adjustingACK/NACK bits. According to certain illustrative examples, the contentsof HARQ-ACK₁(i) and HARQ-ACK₂(i) are determined as follows when Mp andMs are not equal, and one of Mp and Ms is not zero. This approachstrives to keep the maximum number of PCell bits in HARQ-ACK₁(i) and themaximum number of SCell bits in HARQ-ACK₂(i) Also, the HARQ-ACK bitswith highest DAI index are bundled across cells.

It is first determined 1002 if M_(max)−M_(min)=3. If it is determined(1002, YES) that M_(max)−M_(min)=3, then the bits are set as follows:

-   -   For Mp<M, the two sets of ACK/NACK bits are set 1004 as:        -   HARQ-ACK₁(i)={HARQ-ACK_(p)(0), . . . , HARQ-ACK_(p)(Mp−1),            HARQ-ACK_(s)(Ms−1), DTX}, and        -   HARQ-ACK₂(i)={HARQ-ACK_(s)(0), . . . , HARQ-ACK_(s)(Ms−2)}    -   For Ms<M, the two sets of ACK/NACK bits are set 1006 as:        -   HARQ-ACK₁(i)={HARQ-ACK_(p)(0), . . . , HARQ-ACK_(p)(Mp−2)},            and        -   HARQ-ACK₂(i)={HARQ-ACK_(s)(0), . . . , HARQ-ACK_(s)(Ms−1),            HARQ-ACK_(p)(Mp−1), DTX}

If it is determined (1002, NO) that M_(max)−M_(min) is not equal to 3,then the method proceeds. It is then determined 1008 whetherM_(max)−M_(min)=2. If it is determined (1008, YES) thatM_(max)−M_(min)=2, then the ACK/NACK bits are set as follows:

-   -   For Mp<M, the two sets of ACK/NACK bits are set 1010 as:        -   HARQ-ACK₁(i)={HARQ-ACK_(p)(0), . . . , HARQ-ACK_(p)(Mp−1),            HARQ-ACK_(s)(Ms−1)}, and        -   HARQ-ACK₂(i)={HARQ-ACK_(s)(0), . . . , HARQ-ACK_(s)(Ms−2)}    -   For Ms<M, the two sets of ACK/NACK bits are set 1012 as:        -   HARQ-ACK₁(i)={HARQ-ACK_(p)(0), . . . , HARQ-ACK_(p)(Mp−2)},            and        -   HARQ-ACK₂(i)={HARQ-ACK_(s)(0), . . . , HARQ-ACK_(s)(Ms−1),            HARQ-ACK_(p)(Mp−1)}

If it is determined (1008, NO) that M_(max)−M_(min) is not equal to 2,then the method proceeds. It is then determined 1014 whetherM_(max)−M_(min)=1. If it is determined (1014, YES) thatM_(max)−M_(min)=1, then a DTX bit is appended to the cell with thesmaller number of ACK/NACK bits and the bits are set as follows:

-   -   For Mp<M, the two sets of ACK/NACK bits are set 1016 as:        -   HARQ-ACK₁(i)={HARQ-ACK_(p)(0), . . . , HARQ-ACK_(p)(Mp−1),            DTX}, and        -   HARQ-ACK₂(i)={HARQ-ACK_(s)(0), . . . , HARQ-ACK_(s)(Ms−2)}    -   For Ms<M, the two sets of ACK/NACK bits are set 1018 as:        -   HARQ-ACK₁(i)={HARQ-ACK_(p)(0), . . . , HARQ-ACK_(p)(Mp−1)},            and        -   HARQ-ACK₂(i)={HARQ-ACK_(s)(0), . . . , HARQ-ACK_(s)(Ms−1),            DTX}

In some examples, the UE can append an ACK bit instead of a DTX bit tomake two HARQ-ACK sets with the same length.

If M_(max)−M_(min) does not equal 1, and if M_(max)=M_(min), then theprocess can end (1020).

This method also uses fewer ACK/NACK bits. Therefore it has goodresource utilization and performance. For example, when the PCell isUL/DL configuration 0 and SCell configuration 2, at sub-frame #2, whereMp=1, Ms=4, the number of ACK/NACK bits will be M=ceil{(Mp+Ms)/2}=3,which means that the mapping table uses a total of six bits over bothPCell and SCell.

FIG. 11 is a flowchart showing an illustrative method 1100 for reducingthe number of ACK/NACK bits. In this illustrative method, Mp is equal tothe number of ACK/NACK bits for the primary cell, and Ms is equal to thenumber of ACK/NACK bits for the SCell. According to certain illustrativeexamples, it is determined 1102 if Mp+Ms is less than a predeterminednumber (“X”), e.g., M_(P)+M_(S)<5. For example, the number of ACK/NACKbits can be further reduced if they are arranged to use one serving cellcodebook (one of tables 10.1.3.2-1, 10.1.3.2-2, 10.1.3.2-3, 10.1.3.2-5,or 10.1.3.2-6) when Mp+Ms is less than five.

If it is determined that Mp+Ms is not less than the predeterminednumber, then another method may be used 1104. If, however, it isdetermined that Mp+Ms is indeed less than the predetermined number, thenthe ACK/NACK bits from the PCell and the SCell can be concatenated 1106.The two serving cell mapping table with a bundling window of M=the valueof the predetermined number can then be used 1108; as is discussed inmore detail below.

-   -   Rel-10 spatial bundling is used, where if Mp>1 or Ms>1, spatial        HARQ-ACK bundling across multiple codewords within a DL        sub-frame is performed by a logical AND operation of all the        corresponding individual HARQ-ACKs within the cell whose M>1.        HARQ-ACKs in PCell are not spatially bundled with HARQ-ACKs in        SCell.    -   If (Mp+Ms)<5,        -   the UE shall concatenate ACK/NACK bits from both PCell and            SCell, {HARQ-ACK_(p)(0), . . . , HARQ-ACK_(p)(Mp−1),            HARQ-ACK_(s)(0), . . . , HARQ-ACK_(s)(Ms−1)}        -   use the Rel-10 one serving cell mapping table directly.        -   Instead of using the resource allocation for one serving            cell transmission, the resource allocation is done according            to the methods used with ACK/NACK Tables (one of tables            10.1.3.2-1, 10.1.3.2-2, 10.1.3.2-3, 10.1.3.2-5, or            10.1.3.2-6)

Alternatively, ACK/NACK Tables (one of tables 10.1.3.2-1, 10.1.3.2-2,10.1.3.2-3, 10.1.3.2-5, or 10.1.3.2-6) and the associated resourceallocation may be used when Mp+Ms<5 and the greater of Mp or Ms<3.Through use of methods and systems described herein, ACK/BACK bitpositions may be used more efficiently without requiring modification ofstandard codebook mapping tables.

While this disclosure contains many specifics, these should not beconstrued as limitations on the scope of what may be claimed, but ratheras descriptions of features that may be specific to particularimplementations. Certain features that are described in thisspecification in the context of separate implementations can also beimplemented in combination in a single implementation. Conversely,various features that are described in the context of a singleimplementation can also be implemented in multiple implementationsseparately or in any suitable sub-combination. Moreover, althoughfeatures may be described above as acting in certain combinations, oneor more features from a combination can in some cases be excised fromthe combination, and the combination may be directed to asub-combination or variation of a sub-combination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. In certain circumstances, multitasking and parallel processingmay be advantageous. Moreover, the separation of various systemcomponents in the implementations described above should not beunderstood as requiring such separation in all implementations.

The features described above may give rise to one or more advantages.For example, methods described herein enable support for carrieraggregation of cells that have different TDD UL/DL configurations whileallowing for better performing transmission of ACK/NACK bits.

1-28. (canceled)
 29. A method for transmitting Acknowledgement/NegativeAcknowledgement (ACK/NACK) bits for carrier aggregation between a firstcell and a second cell by a User Equipment (UE), the method comprising:transmitting, an ACK/NACK bit for the second cell; and reorderingACK/NACK bit positions of at least one of an ACK/NACK bit position forthe first cell or an ACK/NACK bit position of the second cell, whereinthe reordering comprises: transmitting a last ACK/NACK bit for thesecond cell using a bit position of one of a last ACK/NACK bit or a nextto last ACK/NACK bit for the first cell, the last ACK/NACK bit for thefirst cell corresponds to a sub-frame on the first cell that istransmitted last to the UE, and the next to last ACK/NACK bit for thefirst cell corresponds to a sub-frame that is transmitted immediatelyprior to the sub-frame on the first cell that is transmitted last to theUE.
 30. The method of claim 29, further comprising: determining thatsub-frames that correspond to the ACK/NACK bits for the first cell areof a different configuration than sub-frames that correspond to theACK/NACK bits for the second cell.
 31. The method of claim 29, whereinthe ACK/NACK bit position for the first or the second cell is describedin a table, the table associating combinations of ACK/NACK bits toACK/NACK signals transmitted by the UE.
 32. The method of claim 29,further comprising: determining that a first number of ACK/NACK bits forthe first cell is zero; and indicating with an ACK/NACK ResourceIndicator (ARI) a number of resources, the number of resources beingequal to a second number of ACK/NACK bits for the second cell.
 33. Themethod of claim 29, wherein the first cell is a primary cell and thesecond cell is a secondary cell.
 34. The method of claim 29, wherein thesecond cell is a primary cell and the first cell is a secondary cell.35. A device for transmitting Acknowledgement/Negative Acknowledgement(ACK/NACK) bits for carrier aggregation between a first cell and asecond cell by a User Equipment (UE), the device comprising: a memory;and at least one hardware processor communicatively coupled with thememory and configured to: transmit, an ACK/NACK bit for the second cell;and reorder ACK/NACK bit positions of at least one of an ACK/NACK bitposition for the first cell or an ACK/NACK bit position of the secondcell, wherein the reordering comprises: transmitting a last ACK/NACK bitfor the second cell using a bit position of one of a last ACK/NACK bitor a next to last ACK/NACK bit for the first cell, the last ACK/NACK bitfor the first cell corresponds to a sub-frame on the first cell that istransmitted last to the UE, and the next to last ACK/NACK bit for thefirst cell corresponds to a sub-frame that is transmitted immediatelyprior to the sub-frame on the first cell that is transmitted last to theUE.
 36. The device of claim 35, further comprising: determining thatsub-frames that correspond to the ACK/NACK bits for the first cell areof a different configuration than sub-frames that correspond to theACK/NACK bits for the second cell.
 37. The device of claim 35, whereinthe ACK/NACK bit position for the first or the second cell is describedin a table, the table associating combinations of ACK/NACK bits toACK/NACK signals transmitted by the UE.
 38. The device of claim 35,wherein the at least one hardware processor is further configured to:determine that a first number of ACK/NACK bits for the first cell iszero; and indicate with an ACK/NACK Resource Indicator (ARI) a number ofresources, the number of resources being equal to a second number ofACK/NACK bits for the second cell.
 39. The device of claim 35, whereinthe first cell is a primary cell and the second cell is a secondarycell.
 40. The device of claim 35, wherein the second cell is a primarycell and the first cell is a secondary cell.
 41. A non-transitorycomputer-readable medium storing instructions that are operable whenexecuted by data processing apparatus to perform operations fortransmitting Acknowledgement/Negative Acknowledgement (ACK/NACK) bitsfor carrier aggregation between a first cell and a second cell by a UserEquipment (UE), the operations comprising: transmitting, an ACK/NACK bitfor the second cell; and reordering ACK/NACK bit positions of at leastone of an ACK/NACK bit position for the first cell or an ACK/NACK bitposition of the second cell, wherein the reordering comprises:transmitting a last ACK/NACK bit for the second cell using a bitposition of one of a last ACK/NACK bit or a next to last ACK/NACK bitfor the first cell, the last ACK/NACK bit for the first cell correspondsto a sub-frame on the first cell that is transmitted last to the UE, andthe next to last ACK/NACK bit for the first cell corresponds to asub-frame that is transmitted immediately prior to the sub-frame on thefirst cell that is transmitted last to the UE.
 42. The non-transitorycomputer-readable medium of claim 40, wherein the operations furthercomprise: determining that sub-frames that correspond to the ACK/NACKbits for the first cell are of a different configuration than sub-framesthat correspond to the ACK/NACK bits for the second cell.
 43. Thenon-transitory computer-readable medium of claim 40, wherein theACK/NACK bit position for the first or the second cell is described in atable, the table associating combinations of ACK/NACK bits to ACK/NACKsignals transmitted by the UE.
 44. The non-transitory computer-readablemedium of claim 40, wherein the operations further comprise: determiningthat a first number of ACK/NACK bits for the first cell is zero; andindicating with an ACK/NACK Resource Indicator (ARI) a number ofresources, the number of resources being equal to a second number ofACK/NACK bits for the second cell.
 45. The non-transitorycomputer-readable medium of claim 40, wherein the first cell is aprimary cell and the second cell is a secondary cell.
 46. Thenon-transitory computer-readable medium of claim 40, wherein the secondcell is a primary cell and the first cell is a secondary cell.